A practical sieve algorithm for finding prime numbersXUEDONG LUO.Communications of the ACM. 1989, Vol 32, Num 3, pp 344-346, issn 0001-0782Article

Les nombres premiers insolites = Strange prime numbersDELAHAYE, Jean-Paul.Pour la science (Imprimé). 2010, Num 396, pp 88-92, issn 0153-4092, 5 p.Article

Every odd perfect number has a prime factor which exceeds 10⁶HAGIS, P. JR; COHEN, G. L.Mathematics of computation. 1998, Vol 67, Num 223, pp 1323-1330, issn 0025-5718Article

Deux énigmes de Paul Erdös : Grandes et petites énigmes mathématiques = Two enigmas of Paul ErdösBOUDINE, Jean-Pierre.Recherche (Paris, 1970). 2001, Num 346, issn 0029-5671, p. 97Article

Les nombres premiers = Prime numbersCOHEN, H.Recherche (Paris, 1970). 1995, Num 278, pp 760-765, issn 0029-5671Article

Hyperbolic prime number theoremFRIEDLANDER, John B; IWANIEC, Henryk.Acta mathematica. 2009, Vol 202, Num 1, pp 1-19, issn 0001-5962, 19 p.Article

Les nombres premiers = The prime numbersRITTAUD, Renoit.Recherche (Paris, 1970). 2004, Num 377, pp 87-90, issn 0029-5671, 4 p.Article

The Rabin-Monier theorem for Lucas pseudoprimesARNAULT, F.Mathematics of computation. 1997, Vol 66, Num 218, pp 869-881, issn 0025-5718Article

Density of Carmichael numbers with three prime factorsBALASUBRAMANIAN, R; NAGARAJ, S. V.Mathematics of computation. 1997, Vol 66, Num 220, pp 1705-1708, issn 0025-5718Article

Further tabulation of the Erdös-Selfridge functionLUKES, R. F; SCHEIDLER, R; WILLIAMS, H. C et al.Mathematics of computation. 1997, Vol 66, Num 220, pp 1709-1717, issn 0025-5718Article

Wilson quotients for composite moduliAGOH, T; DILCHER, K; SKULA, L et al.Mathematics of computation. 1998, Vol 67, Num 222, pp 843-861, issn 0025-5718Article

La maîtrise des nombres premiers = The mastery of prime numbersDELAHAYE, Jean-Paul.Pour la science (Imprimé). 2011, Num 408, pp 88-93, issn 0153-4092, 6 p.Article

Un terrain de course numérique = A numerical running fieldDELAHAYE, Jean-Paul.Pour la science (Imprimé). 2010, Num 389, pp 88-93, issn 0153-4092, 6 p.Article

Le plus grand des premiersREIX, Tony.La Recherche (Imprimé). 2009, Num 431, pp 46-48, issn 0029-5671, 3 p.Article

La marelle arithmétique = Arithmetic hopscotchDELAHAYE, Jean-Paul.Pour la science. 2007, Num 360, pp 90-95, issn 0153-4092, 6 p.Article

Class number bounds and Catalan's equationSTEINER, R.Mathematics of computation. 1998, Vol 67, Num 223, pp 1317-1322, issn 0025-5718Article

On divisibility of the class number h⁺ of the real cyclotomic fields of prime degree lJAKUBEC, S.Mathematics of computation. 1998, Vol 67, Num 221, pp 369-398, issn 0025-5718Article

A search for Wieferich and Wilson primesCRANDALL, R; DILCHER, K; POMERANCE, C et al.Mathematics of computation. 1997, Vol 66, Num 217, pp 433-449, issn 0025-5718Article

A simple approach for generating RSA keysCHANG, C.-C; HWANG, S.-J.Information processing letters. 1997, Vol 63, Num 1, pp 19-21, issn 0020-0190Article

On the Pjateckii-sapiro prime number theoremLIU, H. Q; RIVAT, J.Bulletin of the London Mathematical Society. 1992, Vol 24, pp 143-147, issn 0024-6093, 2Article

On fundamental units of real quadratic fields with norm +1KATAYAMA, S.Proceedings of the Japan Academy. Series A Mathematical sciences. 1992, Vol 68, Num 1, pp 18-20, issn 0386-2194Article

On admissible constellations of consecutive primesERDOS, P; RIESEL, H.BIT (Nordisk Tidskrift for Informationsbehandling). 1988, Vol 28, Num 3, pp 391-396, issn 0006-3835Article

L'INFINITÉ DES NOMBRES PREMIERS: UNE ÉTUDE DE CAS DE LA PURETÉ DES MÉTHODES = The infinity of prime numbers: A case study of the methods' purityARANA, Andrew; HALIMI, Brice.Les Etudes philosophiques (Paris). 2011, Num 2, issn 0014-2166, 193-213, 282 [22 p.]Article

Minus class groups of the fields of the l-TH roots of unitySCHOOF, R.Mathematics of computation. 1998, Vol 67, Num 223, pp 1225-1245, issn 0025-5718Article

On ø-amicable pairsCOHEN, G. L; TE RIELE, H. J. J.Mathematics of computation. 1998, Vol 67, Num 221, pp 399-411, issn 0025-5718Article